Counting flags in triangle-free digraphs
نویسندگان
چکیده
منابع مشابه
Counting flags in triangle-free digraphs
An important instance of the Caccetta-Häggkvist conjecture asserts that an n-vertex digraph with minimum outdegree at least n/3 contains a directed triangle. Improving on a previous bound of 0.3532n due to Hamburger, Haxell, and Kostochka we prove that a digraph with minimum outdegree at least 0.3465n contains a directed triangle. The proof is an application of a recent combinatorial calculus d...
متن کاملCounting independent sets in triangle-free graphs
Ajtai, Komlós, and Szemerédi proved that for sufficiently large t every trianglefree graph with n vertices and average degree t has an independent set of size at least n 100t log t. We extend this by proving that the number of independent sets in such a graph is at least 2 1 2400 n t log . This result is sharp for infinitely many t, n apart from the constant. An easy consequence of our result i...
متن کاملCounting paths in digraphs
We begin with some terminology. All digraphs in this paper are finite. For a digraph G, we denote its vertex and edge sets by V (G) and E(G), respectively. Unless otherwise stated, we assume |V (G)| = n. The members of E(G) are ordered pairs of vertices. We use the notation uv to denote an ordered pair of vertices (u, v) (whether or not u and v are adjacent). We only consider digraphs which hav...
متن کاملApproximate Triangle Counting
Triangle counting is an important problem in graph mining. Clustering coefficients of vertices and the transitivity ratio of the graph are two metrics often used in complex network analysis. Furthermore, triangles have been used successfully in several real-world applications. However, exact triangle counting is an expensive computation. In this paper we present the analysis of a practical samp...
متن کاملMore on Counting Acyclic Digraphs
In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology obtained by S.Choi who established exact correspondences between acyclic digraphs and so-called small cove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.105